A graph-based hyper-heuristic for educational timetabling problems
نویسندگان
چکیده
منابع مشابه
A graph-based hyper-heuristic for educational timetabling problems
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Within the hyperheuristic framework, a Tabu Search approach is employed to search for permutations of graph heuristics which are used for constructing timetables in exam and course timetabling problems. This underpins a m...
متن کاملHybridisations within a Graph Based Hyper-heuristic Framework for University Timetabling Problems
A significant body of literature has explored various research directions in hyper-heuristics (which can be thought as heuristics to choose heuristics). In this paper we define a graph based hyper-heuristic (GHH) framework and compare the performance of a number of local search based searching algorithms as the high level heuristics. They are used to search upon permutations of low level graph ...
متن کاملHybridizations within a graph-based hyper-heuristic framework for university timetabling problems
A significant body of recent literature has explored various research directions in hyperheuristics (which can be thought as heuristics to choose heuristics). In this paper, we extend our previous work to construct a unified graph based hyper-heuristic (GHH) framework, under which a number of local search based algorithms as the high level heuristics are studied to search upon sequences of low ...
متن کاملCase-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems
This paper studies Knowledge Discovery (KD) using Tabu Search and Hill Climbing within Case-Based Reasoning (CBR) as a hyper-heuristic method for course timetabling problems. The aim of the hyper-heuristic is to choose the best heuristic(s) for given timetabling problems according to the knowledge stored in the case base. KD in CBR is a 2-stage iterative process on both case representation and ...
متن کاملHybrid Graph Heuristics within a Hyper-heuristic Approach to Exam Timetabling Problems
This paper is concerned with the hybridization of two graph coloring heuristics (Saturation Degree and Largest Degree), and their application within a hyperheuristic for exam timetabling problems. Hyper-heuristics can be seen as algorithms which intelligently select appropriate algorithms/heuristics for solving a problem. We developed a Tabu Search based hyper-heuristic to search for heuristic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2007
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2005.08.012